A unified model for multimedia retrieval by content
نویسندگان
چکیده
In this paper, we propose a unified model for indexing and retrieving multimedia data using characteristic features and multiresolution processing. All multimedia data types, such as audio and video, are represented as a k-dimensional signal in a spatio-temporal domain [3]. A k-dimensional signal is transformed into characteristic features and these features are stored in a hierarchical multidimensional structure, called the k-tree. With this approach, both the retrieval accuracy and response time can be dynamically adapted. We present measurements on accuracy and response times for the various levels of the k-tree structure.
منابع مشابه
A universal k-tree model for content-based multimedia retrieval
In this paper, we propose a unified model for indexing and retrieving multimedia data using characteristic features and multiresolution processing. Each multimedia datatype, such as audio and video, is represented as a k-dimensional signal in the spatio-temporal domain. A k-dimensional signal is transformed into characteristic features (contents) and these features are stored in a hierarchical ...
متن کاملBalancing Strategies for Parallel Content-based Data Retrieval Algorithms in a k-tree Structured Database
The paper proposes a unified model for multimedia data retrieval which includes data representatives, content representatives, index structure, and search algorithms. The multimedia data are defined as k-dimensional signals indexed in a multidimensional k-tree structure. The benefits of using the k-tree unified model were demonstrated by running the data retrieval application on a six networked...
متن کاملParallel Processing Algorithms for Content-based Retrieval from a Multimedia Database
The paper proposes a data partitioning algorithm for content-based retrieval from a multimedia database using a homogeneous cluster system. The multimedia data are represented in a unified model formed into a hierarchical multidimensional k-tree structure. The parallel retrieval algorithms run on a cluster of homogeneous processing units using a dedicated type of shared memory. We use system ch...
متن کاملA parallel algorithm for multi-feature content-based multimedia retrieval
In this paper, we propose a parallel, unified model for the indexing and retrieval by content of multimedia data using a weighted cascade. [4] Each multimedia data type can be viewed as k-dimensional (k-d) data in spatiotemporal domain. [3] Each dimension of the data is separated into small blocks and then formed into a multidimensional tree structure, called a k-tree. Using the ktree structure...
متن کاملA Parallel Model for Multimedia Database on Cluster System Environment
In this paper, we propose a parallel model for content-based retrieval form a multimedia database using a heterogeneous cluster system. The proposed parallel unified model [6] was used to represent multimedia data. All types of multimedia data in the unified model are represented by k-dimensional signals. Each dimension of k-d data is separated into small blocks and then formed into a hierarchi...
متن کاملContent-Based Multimedia Data Retrieval on Cluster System Environment
In this paper, we propose a data partitioning scheme for contentbased retrieval from a multimedia database using a heterogeneous cluster system. The proposed parallel unified model [6] was used to represent multimedia data. All types of multimedia data in the unified model are represented by k-dimensional(k-d) signals. Each dimension of k-d data is separated into small blocks and then formed in...
متن کامل